The isomorphism problem for cyclically pinched one-relator groups
نویسندگان
چکیده
منابع مشابه
Cyclically Pinched One-relator Groups and Generic Property Soyoung Moon
We show that a class of cyclically pinched one-relator groups admits amenable, faithful and transitive actions on infinite countable sets. This work generalizes the results on such actions for doubles of free group on 2 generators.
متن کاملVirtual Properties of cyclically pinched One-Relator Groups
We prove that the amalgamated product of free groups with cyclic amalgamations satisfying certain conditions are virtually free-by-cyclic. In case the cyclic amalgamated subgroups lie outside the derived group such groups are free-by-cyclic. Similarly a one-relator HNN-extension in which the conjugated elements either coincide or are independent modulo the derived group is shown to be free-by-c...
متن کاملfaithful real representations of cyclically pinched one-relator groups
in cite{fr 1, fr 2} using faithful complex representations of cyclically pinched and conjugacy pinched one-relator groups we proved that any limit group has a faithful representation in $psl(2,c)$. further this representation can be effectively constructed using the jsj decomposition. in this note we show that any hyperbolic cyclically pinched one-relator group with maximal amalgamated ...
متن کاملGenericity, the Arzhantseva-ol’shanskii Method and the Isomorphism Problem for One-relator Groups
We apply the method of Arzhantseva-Ol’shanskii to prove that for an exponentially generic (in the sense of Ol’shanskii) class of one-relator groups the isomorphism problem is solvable in at most exponential time. This is obtained as a corollary of the more general result that for any fixed integers m > 1, n > 0 there is an exponentially generic class of m-generator n-relator groups where every ...
متن کاملOn One-relator Inverse Monoids and One-relator Groups
It is known that the word problem for one-relator groups and for one-relator monoids of the form Mon〈A ‖ w = 1〉 is decidable. However, the question of decidability of the word problem for general one-relation monoids of the form M = Mon〈A ‖ u = v〉 where u and v are arbitrary (positive) words in A remains open. The present paper is concerned with one-relator inverse monoids with a presentation o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1994
ISSN: 0022-4049
DOI: 10.1016/0022-4049(94)90119-8